A Radial Adaptation of the Sugiyama Framework for Hierarchical Graph Drawing
نویسندگان
چکیده
In radial drawings of hierarchical graphs the vertices are drawn on concentric circles instead of on horizontal lines as in the standard Sugiyama framework. This drawing style is well suited for the visualisation of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two directions. In experimental results this reduces the number of crossings by approx. 30% on average. This paper is the last step to complete the framework for drawing hierarchical graphs in a radial fashion. We present three heuristics for crossing reduction in radial level drawings of hierarchical graphs, and also briefly cover extensions of the level assignment step to take advantage of the increasing perimeter of the circles.
منابع مشابه
A Radial Adaption of the Sugiyama Framework for Hierarchical Graph Drawing
In radial drawings of hierarchical graphs the vertices are drawn on concentric circles instead of on horizontal lines as in the standard Sugiyama framework. This drawing style is well suited for the visualisation of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two...
متن کاملOnline Hierarchical Graph Drawing
We propose a heuristic for maintaining dynamic hierarchical graph layouts. The heuristic is an on-line interpretation of the static layout algorithm of Sugiyama, Togawa and Toda. It incorporates topological and geometric information with the objective of making layout animations that are both incrementally stable and readable through long editing sequences. We present measurements of an experim...
متن کاملCyclic Leveling of Directed Graphs
The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. g., distinguished cycles in the biosciences and processes that repeat in a daily or weekly turn. ...
متن کاملPort Constraints in Hierarchical Layout of Data Flow Diagrams
We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practice. The KIELER framework aims at improving this by offering novel user interaction techniques, enabled by automatic layout of the diagrams. In this paper we present extensions of the well-known hierarchical layout approach, ori...
متن کاملCrossing Reduction for Hierarchical Graphs with Intra-Level Edges
In drawings of hierarchical graphs generated by the conventional Sugiyama framework the vertices are positioned on multiple horizontal level lines. This drawing style which allows edges only between vertices on different levels is well suited for the visualization of a common direction of flow from lower to higher levels in a graph. In this paper we are interested in reordering the vertices on ...
متن کامل